Pick's Theorem - What's the Big Deal?

نویسنده

  • John E. McCarthy
چکیده

Of course, finding the infimum is computationally harder than answering the question of whether the infimum is less than or equal to some fixed value, but mathematically the problems are equivalent. By a standard compactness argument (what a complex analyst would call a normal family argument), the infimum in (IP) will be attained. By rescaling, we can assume this infimum is 1, and then the Pick matrix (2) cannot be strictly positive definite (for if it were, it would remain so if all the wi s were increased by some factor slightly bigger than one, which would mean by the first part

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Pick's Theorem via Minkowski's Theorem

ACKNOWLEDGMENTS This note was inspired by Brian Davies, who challenged Nick Trefethen at Oxford by pointing out that the evaluation of the integral (7) would cause serious difficulties both analytically and numerically. One of the authors (T.S.) had the pleasure of attending Trefethen’s course in Oxford, where problems like Davies’s had to be solved on a weekly basis. Discussing the integral wi...

متن کامل

Pick's Theorem in Two-Dimensional Subspace of ℝ3

In the Euclidean space ℝ(3), denote the set of all points with integer coordinate by ℤ(3). For any two-dimensional simple lattice polygon P, we establish the following analogy version of Pick's Theorem, k(I(P) + (1/2)B(P) - 1), where B(P) is the number of lattice points on the boundary of P in ℤ(3), I(P) is the number of lattice points in the interior of P in ℤ(3), and k is a constant only rela...

متن کامل

A formal proof of Pick's Theorem

We start by establishing the result for an elementary triangle: one whose vertices are lattice points and which contains no other lattice points either in its interior or boundary. Pick’s theorem for such a triangle simply asserts that it has area 1/2, or 0 in the degenerate cases where it is flat. Given two vectors A and B, we can consider them as defining the linear transformation of the plan...

متن کامل

Completely Monotone Sequences and Universally Prestarlike Functions

We introduce universally convex, starlike and prestarlike functions in the slit domain C \ [1,∞), and show that there exists a very close link to completely monotone sequences and Pick functions.

متن کامل

Uncountably many bounded positive solutions for a second order nonlinear neutral delay partial difference equation

In this paper we consider the second order nonlinear neutral delay partial difference equation $Delta_nDelta_mbig(x_{m,n}+a_{m,n}x_{m-k,n-l}big)+ fbig(m,n,x_{m-tau,n-sigma}big)=b_{m,n}, mgeq m_{0},, ngeq n_{0}.$Under suitable conditions, by making use of the Banach fixed point theorem, we show the existence of uncountably many bounded positive solutions for the above partial difference equation...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • The American Mathematical Monthly

دوره 110  شماره 

صفحات  -

تاریخ انتشار 2003